搜索资源列表
Knapsack
- 设计一般背包问题的贪心算法，对于任意给定的一般背包问题，都能够得到最优解-Greedy algorithm design in general knapsack problem, for any given general knapsack problem, are able to obtain the optimal solution
knapsack
- 本源程序主要是实现算法中的0-1背包问题，此程序在Visual C++6.0下实现-implement the knapsack problem
Knapsack
- 用java实现的01背包问题的有分支限界的回溯算法，注释非常详细，是我作业的一部分。伪代码可以参考《计算机算法与数据结构》这本书-Using java to achieve 01 knapsack problem branch-and-bound backtracking algorithm and very detailed notes, is part of my job. The pseudo-code can refer to this book of computer algorith
ts-solve-0-1-knapsack-a-info
- 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data
knapsack
- VB背包问题遗传算法求解的源码实例,有兴趣的可以下载。-VB knapsack problem genetic algorithm source code examples, are interested in can be downloaded.
knapsack
- A branch and bound algorithm for the 0-1 knapsack problem.
Knapsack
- 算法设计与分析中背包问题。 首先将最优解矩阵的第一行和第一列均赋值为0；然后从上至下、从左至右依次计算m[i][j]的值，如果第i个物品 的重量大于j的值，即第i个物品不放入背包中，则将m[i][j]赋值为m[i-1][j]，否则取第i个物品放入背包和不放入背 包所得价值的最大值；最后从后往前计算最优解向量的值，如果m[i][j]=m[i-1][j]，则将x[i]赋值为0，否则将x[i] 赋值为1，并将j减去第i个物品的重量。-The knapsack problem al
knapsack
- algorithm Knapsack Problem genetic algorithms
backpack-problem
- 描述《算法引论》上最基本的背包问题，PPT以及算法源码的实现-The most basic descr iption of the knapsack problem, " Introduction to Algorithms" on, PPT and algorithm realization source
4.KNAPSACK
- Implement 0/1 Knapsack problem using dynamic programming
Knapsack
- 使用Java编程，采用回溯算法来解决0-1背包问题。-Using the Java programming using backtracking algorithm to solve 0-1 knapsack problem.
Algoritma-GA-(Knapsack)
- MatLab code Genetic Algorithm for Knapsack Problem
Knapsack
- 用贪心法求解背包问题。 构造方法，求解背包问题。参数kweight指定背包重量，数组arts提供若干物品-Knapsack problem using greedy method.
NP-hard-problem
- matlab模拟退火算法，处理背包问题，相比较与遗传算法模拟退火原理简单，编译容易-matlab simulated annealing algorithm to handle the knapsack problem, compared with the genetic simulated annealing algorithm is simple, easy to compile
knapsack
- This knapsack problem solved by using Matlab Platform
Knapsack
- 算法设计，Knapsack算法解决背包问题，C#编写-Design of the algorithm, the Knapsack algorithm to solve knapsack problem, C# prepared
GA-knapsack-
- 遗传算法解决背包问题。内含genetic工具包。-Genetic algorithm to solve knapsack problem. Contains genetic toolkit.
knapsack.m
- KNAPSACK Solves the 0-1 knapsack problem for positive integer weights - dynamic programming
lab7-knapsack
- the code for the knapsack problem
QGA-AND-GA-for-knapsack
- 本源程序里面实现了基本的遗传算法与量子遗传算法实现0-1背包问题，并对实现结果截图并分析了。-The source of which the realization of the genetic algorithm and the quantum genetic algorithm to achieve the basic 0-1 knapsack problem, and the results were analyzed.